Optimal three-dimensional layout of interconnection networks
نویسندگان
چکیده
The main bene1ts of a three-dimensional layout of interconnection networks are the savings in material (measured as volume) and the shortening of wires. The result presented in this paper is a general formula for calculating a lower bound on the volume. Moreover, for butter3y and X-tree networks we show layouts optimizing the maximum wire length and whose upper bounds on the volume are close to the lower bounds. c © 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
On Three-Dimensional Layout of Interconnection Networks (Extended Abstract) *
Abs t r ac t . In this paper we deal with the layout of interconnection networks on three-dimensional grids. In particular, in the first, part we prove a general formula for calculating an exact value for the lower bound on the volume. Then we introduce the new notion of k-3D double channel routing and we use it to exhibit an optimal three-dimensional layout for butterfly networks. Finally, we ...
متن کاملEstimating interconnection lengths in three-dimensional computer systems
| Three-dimensional systems can be used to alleviate the pin limitation problem. The bene-ts can be characterised by estimating the important layout properties of electronic designs, such as space requirements and interconnection length values. For a two-dimensional placement, Donath found an upper bound for the average interconnection length that follows the trends of experimentally obtained a...
متن کاملA dynamic programming approach for layout optimization of interconnection networks
The reliability and cost are two important performance measures of an interconnection network. Both these aspects need to be attended at the layout design stage for an appropriate trade-off between them. This paper introduces a new approach for layout optimization of interconnection networks using dynamic programming. Our principal objective here is to optimize the network layout so as to maxim...
متن کاملNearly Optimal Three Dimensional Layout of Hypercube Networks
In this paper we consider the three-dimensional layout of hypercube networks. Namely, we study the problem of laying hypercube networks out on the three-dimensional grid with the properties that all nodes are represented as rectangular slices and lie on two opposite sides of the bounding box of the layout volume. We present both a lower bound and a layout method providing an upper bound on the ...
متن کاملVirtual Path Layouts in ATM Networks
We study virtual path layouts in a very popular type of fast interconnection networks, namely ATM networks. One of the main problems in such networks is to construct path layout that minimizes the hop-number (i.e. the number of virtual paths between any two nodes) as a function of edge congestion (i.e. the number of virtual paths going through a link). In this paper we construct for any n verte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 255 شماره
صفحات -
تاریخ انتشار 2001